Reconstructing a three-color scenery by observing it along a simple random walk path
نویسنده
چکیده
Let {ξ(n)}n∈Z be a two-color random scenery, that is, a random coloring of Z in two colors, such that the ξ(i)’s are i.i.d. Bernoulli variables with parameter 1 2 . Let {S(n)}n∈N be a symmetric random walk starting at 0. Our main result shows that a.s., ξ ◦ S (the composition of ξ and S) determines ξ up to translation and reflection. In other words, by observing the scenery ξ along the random walk path S, we can a.s. reconstruct ξ up to translation and reflection. This result gives a positive answer to the question of H. Kesten of whether one can a.s. detect a single defect in almost every two-color random scenery by observing it only along a random walk path.
منابع مشابه
Reconstructing a 2-color scenery by observing it along a simple random walk path
Let {~(n)}nEZbe a 2-color random scenery, that is a random coloration of in two colors, such that the ~(i)'s are i.i.d. Bernoulli variables with parameter~. Let {S(n)}nEN be a symmetric random walk starting at O. Our main result shows that a.s., ~ 0 S (the composition of ~ and S) determines ~ up to translation and reflection. In other words, by observing the scenery ~ along the random walk path...
متن کاملReconstructing a random scenery in polynomial time
Benjamini asked whether the scenery reconstruction problem can be solved in polynomial time In this article we answer his question in the a rmative for an i i d uniformly colored scenery on Z observed along a random walk path with bounded jumps We assume the random walk is recurrent can reach every integer with positive probability and the number of possible single steps for the random walk exc...
متن کاملDetecting the Trail of a Random Walker in a Random Scenery
Suppose that the vertices of the lattice Z are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins. For which walks and dimensions can the resulting scenery be distinguished from the original scenery? We find the answer for simple random walk, where it does not depend o...
متن کاملReconstructing the environment seen by a RWRE
Consider a walker performing a random walk in an i.i.d. random environment, and assume that the walker tells us at each time the environment it sees at its present location. Given this history of the transition probabilities seen from the walker but not its trajectory can we reconstruct the law of the environment? We show that in a one-dimensional environment, the law of the environment can be ...
متن کاملInformation Recovery From A Randomly Mixed Up Message-Text
This paper is concerned with finding a fingerprint of a sequence. As input data one uses the sequence which has been randomly mixed up by observing it along a random walk path. A sequence containing order exp(n) bits receives a fingerprint with roughly n bits information. The fingerprint is characteristic for the original sequence. With high probability the fingerprint depends only on the initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 15 شماره
صفحات -
تاریخ انتشار 1999